0.12/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.13	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.12/0.34	% Computer   : n007.cluster.edu
0.12/0.34	% Model      : x86_64 x86_64
0.12/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory     : 8042.1875MB
0.12/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 1200
0.12/0.34	% WCLimit    : 120
0.12/0.34	% DateTime   : Tue Jul 13 11:28:34 EDT 2021
0.12/0.34	% CPUTime    : 
0.12/0.34	% Number of cores: 8
0.19/0.34	% Python version: Python 3.6.8
0.19/0.34	# Version: 2.6rc1-ho
0.19/0.34	# No SInE strategy applied
0.19/0.34	# Trying AutoSched0 for 59 seconds
0.19/0.37	# AutoSched0-Mode selected heuristic G_N___023_B07_F1_PI_Q7_CS_OS_S0Y
0.19/0.37	# and selection function SelectMaxLComplexAvoidPosPred.
0.19/0.37	#
0.19/0.37	# Preprocessing time       : 0.027 s
0.19/0.37	
0.19/0.37	# Proof found!
0.19/0.37	# SZS status Theorem
0.19/0.37	# SZS output start CNFRefutation
0.19/0.37	thf(ax, conjecture, ?[X1:$i > $i > $o]:refl @ X1, file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax)).
0.19/0.37	thf(refl, axiom, (refl)=(^[X1:$i > $i > $o]:![X2:$i]:X1 @ X2 @ X2), file('/export/starexec/sandbox/benchmark/theBenchmark.p', refl)).
0.19/0.37	thf(c_0_2, negated_conjecture, ~(?[X1:$i > $i > $o]:![X4:$i]:X1 @ X4 @ X4), inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[ax]), refl])).
0.19/0.37	thf(c_0_3, negated_conjecture, ![X5:$i > $i > $o]:~X5 @ (esk1_1 @ X5) @ (esk1_1 @ X5), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])).
0.19/0.37	thf(c_0_4, negated_conjecture, ![X1:$i > $i > $o]:~X1 @ (esk1_1 @ X1) @ (esk1_1 @ X1), inference(split_conjunct,[status(thm)],[c_0_3])).
0.19/0.37	thf(c_0_5, negated_conjecture, ($false), inference(flex_resolve,[status(thm)],[c_0_4]), ['proof']).
0.19/0.37	# SZS output end CNFRefutation
0.19/0.37	# Proof object total steps             : 6
0.19/0.37	# Proof object clause steps            : 2
0.19/0.37	# Proof object formula steps           : 4
0.19/0.37	# Proof object conjectures             : 5
0.19/0.37	# Proof object clause conjectures      : 2
0.19/0.37	# Proof object formula conjectures     : 3
0.19/0.37	# Proof object initial clauses used    : 1
0.19/0.37	# Proof object initial formulas used   : 2
0.19/0.37	# Proof object generating inferences   : 0
0.19/0.37	# Proof object simplifying inferences  : 0
0.19/0.37	# Training examples: 0 positive, 0 negative
0.19/0.37	# Parsed axioms                        : 3
0.19/0.37	# Removed by relevancy pruning/SinE    : 0
0.19/0.37	# Initial clauses                      : 2
0.19/0.37	# Removed in clause preprocessing      : 1
0.19/0.37	# Initial clauses in saturation        : 1
0.19/0.37	# Processed clauses                    : 1
0.19/0.37	# ...of these trivial                  : 0
0.19/0.37	# ...subsumed                          : 0
0.19/0.37	# ...remaining for further processing  : 0
0.19/0.37	# Other redundant clauses eliminated   : 0
0.19/0.37	# Clauses deleted for lack of memory   : 0
0.19/0.37	# Backward-subsumed                    : 0
0.19/0.37	# Backward-rewritten                   : 0
0.19/0.37	# Generated clauses                    : 0
0.19/0.37	# ...of the previous two non-trivial   : 0
0.19/0.37	# Contextual simplify-reflections      : 0
0.19/0.37	# Paramodulations                      : 0
0.19/0.37	# Factorizations                       : 0
0.19/0.37	# NegExts                              : 0
0.19/0.37	# Equation resolutions                 : 0
0.19/0.37	# Propositional unsat checks           : 0
0.19/0.37	#    Propositional check models        : 0
0.19/0.37	#    Propositional check unsatisfiable : 0
0.19/0.37	#    Propositional clauses             : 0
0.19/0.37	#    Propositional clauses after purity: 0
0.19/0.37	#    Propositional unsat core size     : 0
0.19/0.37	#    Propositional preprocessing time  : 0.000
0.19/0.37	#    Propositional encoding time       : 0.000
0.19/0.37	#    Propositional solver time         : 0.000
0.19/0.37	#    Success case prop preproc time    : 0.000
0.19/0.37	#    Success case prop encoding time   : 0.000
0.19/0.37	#    Success case prop solver time     : 0.000
0.19/0.37	# Current number of processed clauses  : 0
0.19/0.37	#    Positive orientable unit clauses  : 0
0.19/0.37	#    Positive unorientable unit clauses: 0
0.19/0.37	#    Negative unit clauses             : 0
0.19/0.37	#    Non-unit-clauses                  : 0
0.19/0.37	# Current number of unprocessed clauses: 0
0.19/0.37	# ...number of literals in the above   : 0
0.19/0.37	# Current number of archived formulas  : 0
0.19/0.37	# Current number of archived clauses   : 0
0.19/0.37	# Clause-clause subsumption calls (NU) : 0
0.19/0.37	# Rec. Clause-clause subsumption calls : 0
0.19/0.37	# Non-unit clause-clause subsumptions  : 0
0.19/0.37	# Unit Clause-clause subsumption calls : 0
0.19/0.37	# Rewrite failures with RHS unbound    : 0
0.19/0.37	# BW rewrite match attempts            : 0
0.19/0.37	# BW rewrite match successes           : 0
0.19/0.37	# Condensation attempts                : 0
0.19/0.37	# Condensation successes               : 0
0.19/0.37	# Termbank termtop insertions          : 90
0.19/0.37	
0.19/0.37	# -------------------------------------------------
0.19/0.37	# User time                : 0.027 s
0.19/0.37	# System time              : 0.003 s
0.19/0.37	# Total time               : 0.030 s
0.19/0.37	# Maximum resident set size: 1640 pages
0.19/0.37	EOF